Decomposition Ordering as a Tool to Prove the Termination of Rewriting Systems
نویسنده
چکیده
Decomposition ordering is a well-founded monotonic ordering on terms. Because it has the subterm and the deletion properties, decomposition ordering is useful to prove termination of rewriting systems. An algorithm comparing two terms is given.
منابع مشابه
Some Properties of Decomposition Ordering, a Simplification Ordering to Prove Termination of Rewriting Systems
Recursive path ordering is an ordering on terms inttodueed by Dershowitz to prove the termination of rewriting systems. A new ordering, called decomposition ordming, is dejined. It is proved to be equivalent to the path ordering and, as corollary, a simple proof of the wellfoundedness of recursive path ordering is given. Rkumk. L'ordre ricursif sur les chemins a ktk introduit par Dershowitz pou...
متن کاملAutomation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far in tools for automatic termination proving and variants with infinite sets of labels were considered not to be suitable for automation. We show that such automation can be achieved for semantic labelling with natural numbers, in...
متن کاملRecursive Path Ordering for Infinite Labelled Rewrite Systems
Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far in tools for automatic termination proving and variants with infinite sets of labels were considered not to be suitable for automation. We show that such automation can be achieved for semantic labelling with natural numbers, in...
متن کاملTermination of term rewriting using dependency pairs
We present techniques to prove termination and innermost termination of term rewriting systems automatically. In contrast to previous approaches, we do not compare left-and right-hand sides of rewrite rules, but introduce the notion of dependency pairs to compare left-hand sides with special subterms of the right-hand sides. This results in a technique which allows to apply existing methods for...
متن کاملOn a monotonic semantic path ordering
The semantic path ordering >spo is an ordering that allows to prove termination of term rewriting systems. Unlike other such orderings, it is not monotonic. We construct two monotonic suborderings >cspo, >mspo, of >spo. Both orderings rely on reasonable assumptions on the underlying semantic ordering, and mirror Kamin/Lévy’s termination proof method. Moreover, >mspo is shown to cover >spo up to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1981